Randomization algorithms for large sparse networks
نویسندگان
چکیده
منابع مشابه
Efficient quantum algorithms for analyzing large sparse electrical networks
Analyzing large sparse electrical networks is an important problem in physics, electrical engineering and computer science. We propose two classes of quantum algorithms for this problem. The first class is based on solving linear systems, and the second class is based on using quantum walks. These algorithms compute various electrical quantities, including voltages, currents, dissipated powers ...
متن کاملAlgorithms for Visualizing Large Networks
Graphs are often used to encapsulate relationship between objects. Graph drawing enables visualization of such relationships. The usefulness of this visual representation is dependent on whether the drawing is aesthetic. While there are no strict criteria for aesthetics of a drawing, it is generally agreed, for example, that such a drawing has minimal edge crossing, with vertices evenly distrib...
متن کاملLarge-Scale Optimization Algorithms for Sparse Conditional Gaussian Graphical Models
This paper addresses the problem of scalable optimization for l1-regularized conditional Gaussian graphical models. Conditional Gaussian graphical models generalize the well-known Gaussian graphical models to conditional distributions to model the output network influenced by conditioning input variables. While highly scalable optimization methods exist for sparse Gaussian graphical model estim...
متن کاملFaster & Greedier: algorithms for sparse reconstruction of large datasets
We consider the problem of performing sparse reconstruction of large-scale data sets, such as the image sequences acquired in dynamic MRI. Here, both conventional L1 minimization through interior point methods and Orthogonal Matching Pursuit (OMP) are not practical. Instead we present an algorithm that combines fast directional updates based around conjugate gradients with an iterative threshol...
متن کاملAlgorithms and Data Structures for Very Large Sparse Matrices
Sparse matrix-vector multiplication (SpMV) is one of the most important numerical core methods in scientific and engineering computing. On today’s petascale and future exascale systems, the three principal problems related to SpMV are the minimization of communication between processors in distributed-memory environments, the maximization of the efficiency of local SpMV performed by a single pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.99.053311